Convergence Estimates for Multigrid Algorithms without Regularity Assumptions
نویسندگان
چکیده
منابع مشابه
Convergence Estimates for Multigrid Algorithms without Regularity Assumptions
A new technique for proving rate of convergence estimates of multigrid algorithms for symmetric positive definite problems will be given in this paper. The standard multigrid theory requires a "regularity and approximation" assumption. In contrast, the new theory requires only an easily verified approximation assumption. This leads to convergence results for multigrid refinement applications, p...
متن کاملNew Convergence Estimates for Multigrid Algorithms
In this paper, new convergence estimates are proved for both symmetric and nonsymmetric multigrid algorithms applied to symmetric positive definite problems. Our theory relates the convergence of multigrid algorithms to a "regularity and approximation" parameter a 6 (0,1] and the number of relaxations m. We show that for the symmetric and nonsymmetric V cycles, the multigrid iteration converges...
متن کاملConvergence of nonconforming multigrid methods without full elliptic regularity
We consider nonconforming multigrid methods for symmetric positive definite second and fourth order elliptic boundary value problems which do not have full elliptic regularity. We prove that there is a bound (< 1) for the contraction number of the W -cycle algorithm which is independent of mesh level, provided that the number of smoothing steps is sufficiently large. We also show that the symme...
متن کاملUniform Convergence Estimates for Multigrid
In this paper, we provide uniform estimates for V-cycle algorithms with one smoothing on each level. This theory is based on some elliptic regularity but does not require a smoother interaction hypothesis (sometimes referred to as a strengthened Cauchy Schwarz inequality) assumed in other theories. Thus, it is a natural extension of the full regularity V-cycle estimates provided by Braess and H...
متن کاملGlobal convergence analysis of line search interior point methods for nonlinear programming without regularity assumptions∗
It has been noticed by Wächter and Biegler that a number of interior point methods for nonlinear programming based on line search strategy may generate a sequence converging to an infeasible point. We show that by adopting a suitable merit function, a modified primal-dual equation, and a proper line search procedure, a class of interior point methods of line search type will generate a sequence...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1991
ISSN: 0025-5718
DOI: 10.2307/2938661